Higgs Pain? Take a Preon!

The Higgs mechanism is the favourite cure for the main problem with electroweak unification, namely how to reconcile a gauge theory with the need for massive gauge bosons. This problem does not exist in preon models for quark and lepton substructure with composite $Z^0$ and $W$s, which, consequently, also avoid all other theoretical complications and paradoxes with the Higgs mechanism. We present a new, minimal preon model, which explains the family structure, and predicts several new, heavy quarks, leptons and vector bosons. Our preons obey a phenomenological supersymmetry, but without so-called squarks and sleptons, since this SUSY is effective only on the composite scale.Comment: The preon contents of some quarks and leptons have been changed in order to achieve a more consistent scheme. A few new comments have been added. 13 pages, LaTeX, no figures. To be published in Proc. of the Meeting on 'The Fundamental Structure of Matter' and 'Tests of the Electroweak Symmetry Breaking', Ouranoupolis, Greece, May 199

Preon Trinity

We present a new minimal model for the substructure of all known quarks, leptons and weak gauge bosons, based on only three fundamental and stable spin-1/2 preons. As a consequence, we predict three new quarks, three new leptons, and six new vector bosons. One of the new quarks has charge $-4e/3$. The model explains the apparent conservation of three lepton numbers, as well as the so-called Cabibbo-mixing of the $d$ and $s$ quarks, and predicts electromagnetic decays or oscillations between the neutrinos $\bar{\nu}_{\mu}$ ($\nu_{\mu}$) and $\nu_e$ ($\bar{\nu}_e$). Other neutrino oscillations, as well as rarer quark mixings and CP violation can come about due to a small quantum-mechanical mixing of two of the preons in the quark and lepton wave functions.Comment: 5 pages, Latex, no figure

Is Dark Matter made up of Massive Quark Objects?

We suggest that dark matter is made up of massive quark objects that have survived from the Big Bang, representing the ground state of ``baryonic'' matter. Hence, there was no overall phase transition of the original quark matter, but only a split-up into smaller objects. We speculate that normal hadronic matter comes about through enforced phase transitions when such objects merge or collide, which also gives rise to the cosmic gamma-ray bursts.Comment: 8 pages Latex, no figures; to be published in the Proceedings of Dark '98, Heidelberg, July 199

Optimal Unemployment Insurance with Monitoring and Sanctions

This paper analyzes the design of optimal unemployment insurance in a search equilibrium framework where search effort among the unemployed is not perfectly observable.We examine to what extent the optimal policy involves monitoring of search effort and benefit sanctions if observed search is deemed insuficient.We find that introducing monitoring and sanctions represents a welfare improvement for reasonable estimates of monitoring costs; this conclusion holds both relative to a system featuring indefinite payments of benefits and a system with a time limit on unemployment benefit receipt.The optimal sanction rates implied by our calibrated model are much higher than the sanction rates typically observed in European labor markets.unemployment insurance;job search

Gamma-Ray Bursts from Primordial Quark Objects in Space

We investigate the possibility that gamma-ray bursts originate in a concentric spherical shell with a given average redshift and find that this is indeed compatible with the data from the third BATSE (3B) catalog. It is also shown that there is enough freedom in the choice of unknown burst properties to allow even for extremely large distances to the majority of bursts. Therefore, we speculate about an early, and very energetic, origin of bursts, and suggest that they come from phase transitions in massive objects of pure quark matter, left over from the Big Bang.Comment: 11 pages, Latex, 3 postscript figures, to be publ in the Proc of the Joint Meeting of the Networks 'The Fundamental Structure of Matter' and 'Tests of the Electroweak Symmetry Breaking', Ouranoupolis, Greece, May 199

ShapeFit and ShapeKick for Robust, Scalable Structure from Motion

We introduce a new method for location recovery from pair-wise directions that leverages an efficient convex program that comes with exact recovery guarantees, even in the presence of adversarial outliers. When pairwise directions represent scaled relative positions between pairs of views (estimated for instance with epipolar geometry) our method can be used for location recovery, that is the determination of relative pose up to a single unknown scale. For this task, our method yields performance comparable to the state-of-the-art with an order of magnitude speed-up. Our proposed numerical framework is flexible in that it accommodates other approaches to location recovery and can be used to speed up other methods. These properties are demonstrated by extensively testing against state-of-the-art methods for location recovery on 13 large, irregular collections of images of real scenes in addition to simulated data with ground truth

The Chandrasekhar limit for quark stars

The Chandrasekhar limit for quark stars is evaluated from simple energy balance relations, as proposed by Landau for white dwarfs or neutron stars. It has been found that the limit for quark stars depends on, in addition to the fundamental constants, the Bag constant.Comment: LateX fil

Compliance in own-check systems poses challenges in small-scale slaughterhouses

Small-scale slaughterhouses (SHs) face many challenges, not least due to the requirements of food safety legislation. Food business operators' (FBOs') own-check system is very important for food safety, but its proper implementation can be quite difficult and laborious for small-scale SHs. In the European Union, the importance not only of food safety but also facilitation of local food production, including small-scale slaughtering, is highlighted. The aim of our study was to assess compliance with legislation of own-check systems, including six own-check programmes and HACCP, in small-scale SHs. The FBOs' opinions of the implementation of own-check systems were also sought to elucidate possible obstacles in implementation. Our results showed that the best compliance in own-check programmes was achieved in temperature of storage rooms and traceability. FBOs also evaluated these programmes as necessary. However, FBOs' perceived necessity of own-check programmes did not always lead to compliance, as was the case with labelling and HACCP. Instead, in HACCP laboriousness and compliance showed a negative correlation (p <0.05). In addition to laboriousness, costs of own-check programmes, specifically concerning microbiological sampling requirements, appeared to influence compliance, with many of the small-scale SHs poorly following sampling requirements. FBOs also noted the high costs of the non-edible by-product programme. Moreover, the results show that official veterinarians' assessment of compliance was significantly higher than that of the researcher, which warrants further investigation. This study reveals that many small-scale SHs in Finland struggle with food safety requirements. Amendments of some of the requirements to ease the burden of FBOs are proposed. HACCP in particular is suggested to be simplified. In addition, ways to improve food safety and official control in small-scale SHs are discussed.Peer reviewe

Fast Searching in Packed Strings

Given strings $P$ and $Q$ the (exact) string matching problem is to find all positions of substrings in $Q$ matching $P$. The classical Knuth-Morris-Pratt algorithm [SIAM J. Comput., 1977] solves the string matching problem in linear time which is optimal if we can only read one character at the time. However, most strings are stored in a computer in a packed representation with several characters in a single word, giving us the opportunity to read multiple characters simultaneously. In this paper we study the worst-case complexity of string matching on strings given in packed representation. Let $m \leq n$ be the lengths $P$ and $Q$, respectively, and let $\sigma$ denote the size of the alphabet. On a standard unit-cost word-RAM with logarithmic word size we present an algorithm using time O\left(\frac{n}{\log_\sigma n} + m + \occ\right). Here \occ is the number of occurrences of $P$ in $Q$. For $m = o(n)$ this improves the $O(n)$ bound of the Knuth-Morris-Pratt algorithm. Furthermore, if $m = O(n/\log_\sigma n)$ our algorithm is optimal since any algorithm must spend at least \Omega(\frac{(n+m)\log \sigma}{\log n} + \occ) = \Omega(\frac{n}{\log_\sigma n} + \occ) time to read the input and report all occurrences. The result is obtained by a novel automaton construction based on the Knuth-Morris-Pratt algorithm combined with a new compact representation of subautomata allowing an optimal tabulation-based simulation.Comment: To appear in Journal of Discrete Algorithms. Special Issue on CPM 200